Paraconsistent Annotated Logic Program EVALPSN and Its Application to Intelligent Control

نویسندگان

  • Kazumi Nakamatsu
  • Jair Minoro Abe
  • Seiki Akama
چکیده

We have developed an annotated logic program called an Extended Vector Annotated Logic Program with Strong Negation(abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction. We also have extended EVALPSN to deal with before-after relation between processes, which was named beforeafter(abbr. bf)EVALPSN. We have already applied EVALPSN and bf-EVALPSN to various kinds of intelligent control. In this paper, we review how to apply EVALPSN to traffic signal control and bf-EVALPSN to the safety verification of process order control. Key–Words: paraconsistent annotated logic program,traffic signal control, EVALPSN,bf-EVALPSN,intelligent control system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of a Paraconsistent-Fuzzy Digital PID Controller in a Level Control Process

In a modern society the factor corresponding to the increase in the level of quality in industrial production demand new techniques of control and machinery automation. In this context, this work presents the implementation of a Paraconsistent-Fuzzy Digital PID controller. The controller is based on the treatment of inconsistencies both in the Paraconsistent Logic and in the Fuzzy Logic. Paraco...

متن کامل

Coherent Well-founded Annotated Logic Programs

Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the...

متن کامل

On Some Aspects of Decidability of Annotated Systems

In this paper, we discuss some results of decidability of annotated systems. The annotated propositional logic P and its S5 type modal extension S5 are shown to be decidable. These results reveal that annotated systems are computationally attractive as the foundations of paraconsistent rea-

متن کامل

Corporate Profitability Analysis: A Novel Application for Paraconsistent Logic

This study explores the application of paraconsistent annotated evidential logic for analyzing the profitability of companies. We implemented a model that allocated degrees of favorable and contrary evidence to selected profitability ratios, defined using data from sixty-seven food industry companies. The degrees of favorable and contrary evidence assigned to each profitability index were based...

متن کامل

On theorem proving in annotated logics

Annotated logics are a class of paraconsistent logics[?] that have been used to provide the semantical foundations of various reasoning systems which may contain useful inconsistent or imprecise information. They were initially proposed by Subrahmanian based on a specific set, viz. [0, 1] ∪ {>}, of truth values[?], and subsequently studied from the viewpoints of foundation and logic programming...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016